Representing Configuration Knowledge With Weight Constraint Rules
نویسندگان
چکیده
The paper demonstrates that product configuration applications fit naturally the framework of answer set programming. It is shown that product configuration knowledge can be represented systematically and compactly using a logic program type rule language such that the answers of a configuration task, the configurations, correspond to the models of the rule representation.. The paper pr.es.~nts such a"}ule-bised forrealization of a unified configuration oni~o]ogy using a" weight constraint rule language. The language extends normal logic programs with cardinality and weight constraints which leads to a compact and simple formalization. The complexity of the configuration task defined by the formalization is shown to be NP-complete.
منابع مشابه
Unified Configuration Knowledge Representation Using Weight Constraint Rules
In this paper we present an approach to formally defining different conceptualizations of configuration knowledge, modeling configuration knowledge, and implementing the configuration task on the basis of the formalization. The approach is based on a weight constraint rule language and its efficient implementation designed for representing different aspects of configuration knowledge uniformly ...
متن کاملConstraint-based knowledge representation for configuration systems
Configuration is a design activity where the set of available components and their allowed combinations are known a priori. Configuration systems of today are typically rule-based systems. Maintenance and verification of rule-based system has shown to be extremely difficult because the knowledge relating to a single entity is spreading over several rules and modifications to rules must be check...
متن کاملDynamic Constraint Satisfaction in Configuration
Configuration tasks exhibit dynamic aspects which require extending the basic constraint satisfaction framework. In this paper we give a new, well-founded and relatively simple definition of such dynamic constraint satisfaction problems (DCSP). On the basis of the definition, we show that the decision problem for DCSP is NP-complete. We also show that although the complexity of DCSP is the same...
متن کاملSmodels: A System for Answer Set Programming
The Smodels system implements the stable model semantics for normal logic programs. It handles a subclass of programs which contain no function symbols and are domain-restricted but supports extensions including built-in functions as well as cardinality and weight constraints. On top of this core engine more involved systems can be built. As an example, we have implemented total and partial sta...
متن کامل